Background estimation using graph cuts and inpainting

نویسندگان

  • Xida Chen
  • Yufeng Shen
  • Yee-Hong Yang
چکیده

In this paper, we propose a new method, which requires no interactive operation, to estimate background from an image sequence with occluding objects. The images are taken from the same viewpoint under similar illumination conditions. Our method combines the information from input images by selecting the appropriate pixels to construct the background. We have two simple assumptions for the input image sequence: each background pixel has to be disclosed at least once and some parts of the background are never occluded. We propose a cost function that includes a data term and a smoothness term. A unique feature of our data term is that it has not only the stationary term, but also a new predicted term obtained using an image inpainting technique. The smoothness term guarantees that the output is visually smooth so that there is no need for post-processing. The cost is minimized by applying graph cuts optimization. We apply our algorithm to several complex natural scenes as well as to an image sequence with different camera exposure settings, and the results are encouraging.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Image Inpainting by Heuristic Texture and Structure Completion

This paper studies an image inpainting solution based on a primal sketch representation model [1], which divides an image into structure (sketchable) and texture (non-sketchable) components. This solution first predicts the missing structures, such as curves and corners, using a tensor voting algorithm [2]. Then the texture parts along structural sketches are synthesized with the patches sample...

متن کامل

Depth Map Inpainting under a Second-Order Smoothness Prior

Many 3D reconstruction methods produce incomplete depth maps. Depth map inpainting can generate visually plausible structures for the missing areas. We present an inpainting method that encourages at surfaces without favouring fronto-parallel planes. Moreover, it uses a color image to guide the inpainting and align color and depth edges. We implement the algorithm e ciently through graph-cuts. ...

متن کامل

Optimum Patch Selection Using GA in Exemplar Based Image In-painting

Image in-painting is the art of restoring lost and selected parts of an image based on the background information in such a way so that the change is not observed by the observer. Image In-painting is very important and emerging field of research in image processing. Image Inpainting algorithm have numerous applications such as rebuilding of damaged photographs & films, heritage preservation, r...

متن کامل

L0-Norm and Total Variation for Wavelet Inpainting

In this paper, we suggest an algorithm to recover an image whose wavelet coefficients are partially lost. We propose a wavelet inpainting model by using L0-norm and the total variation (TV) minimization. Traditionally, L0-norm is replaced by L1-norm or L2-norm due to numerical difficulties. We use an alternating minimization technique to overcome these difficulties. In order to improve the nume...

متن کامل

Markov Random Field Model-Based Salt and Pepper Noise Removal

Problem of impulse noise reduction is a very well studied problem in image processing community and many different approaches have been proposed to tackle this problem. In the current work, the problem of fixed value impulse noise (salt and pepper) removal from images is investigated by use of a Markov Random Field (MRF) models with smoothness priors. After the formulation of the problem as an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010